On the Average-Case Hardness of CVP
نویسنده
چکیده
We prove a connection of the worst-case complexity to the average-case complexity based on the Closest Vector Problem (CVP) for lattices. Assume that there is an efficient algorithm which can solve approximately a random instance of CVP, with a non-trivial success probability, for lattices under a certain natural distribution, we show that one can approximately solve several lattice problems (including a version of CVP) efficiently for every lattice with
منابع مشابه
Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard
This paper shows the closest vector in a lattice to be NPhard to approximate to within any factor up to 2(logn)1 where = (log logn) c for any constant c < 12 . Introduction A lattice L = L(v1; ::; vn), for vectors v1; ::; vn 2 Rn is the set of all integer linear combinations of v1; ::; vn, that is, L = fP aivi j ai 2 Zg. Given a lattice L and an arbitrary vector y, the Closest Vector Problem (C...
متن کاملTextile Industry in Bangladesh: An Analysis of CVP
The primary attempt of this paper is to evaluate the performance of manufacturing companies based on CVP (Cost-Volume-Profit) analysis in Bangladesh. To attain this purpose, 14 manufacturing companies have been surveyed from Textile Industry. This study has also been attempted to examine the influence of key indicators of CVP analysis in performance evaluation in textile industry. The study fin...
متن کاملA Worst-Case to Average-Case Connection for CVP
We prove a connection of the worst-case complexity and the average-case complexity for the Closest Vector Problem (CVP) for lattices. Assume that there is an eecient algorithm which can solve approximately a random instance of CVP for lattices under a certain natural distribution, at least with a non-trivial success probability over this distribution, we show that one can approximately solve se...
متن کاملClosest Vector Problem
The Closest Vector Problem (CVP) is a computational problem on lattices closely related to SVP. (See Shortest Vector Problem.) Given a lattice L and a target point ~x, CVP asks to find the lattice point closest to the target. As for SVP, CVP can be defined with respect to any norm, but the Euclidean norm is the most common (see the entry lattice for a definition). A more relaxed version of the ...
متن کاملILTRU: An NTRU-Like Public Key Cryptosystem Over Ideal Lattices
In this paper we present a new NTRU-Like public key cryptosystem with security provably based on the worst case hardness of the approximate both Shortest Vector Problem (SVP) and Closest Vector Problem (CVP) in some structured lattices, called ideal lattices. We show how to modify the ETRU cryptosystem, an NTRU-Like public key cryptosystem based on the Eisenstein integers 3 [ ] where 3 is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001